Generic interpolation polynomial for list decoding
نویسندگان
چکیده
منابع مشابه
Efficient Interpolation in Wu List Decoding Algorithm
The interpolation step of Wu list decoding algorithm for Reed-Solomon codes is considered. The problem is reformulated as construction of a partially homogenized interpolation polynomial. A generalization of the binary interpolation algorithm, which is based on the novel formulation of the interpolation step, is provided. It enables complexity reducion both with respect to the Wu method based o...
متن کاملAn Interpolation Algorithm for List Decoding of Reed-Solomon Codes
The interpolation step of Sudan’s list decoding of Reed-Solomon codes sets forth the problem of finding the minimal polynomial of the ideal of interpolating polynomials with respect to a certain monomial order. An efficient algorithm that solves the problem is presented based on the theory of Gröbner bases of modules. In a special case, this algorithm is shown to be equivalent with the Berlekam...
متن کاملIterative list-decoding of Gabidulin codes via Gröbner based interpolation
We show how Gabidulin codes can be list decoded by using an iterative parametrization approach. For a given received word, our decoding algorithm processes its entries one by one, constructing four polynomials at each step. This then yields a parametrization of interpolating solutions for the data so far. From the final result a list of all codewords that are closest to the received word with r...
متن کاملInterpolation in list decoding of Reed-Solomon codes
The problem of efficient implementation of two-dimensional interpolation in the Guruswami-Sudan list decoding algorithm for Reed-Solomon codes is considered. It is shown that it can be implemented by computing the product of the ideals of interpolation polynomials constructed for subsets of interpolation points. A method for fast multiplication of zero-dimensional co-prime ideals product is pro...
متن کاملRetrieving Reed-Solomon coded data under interpolation-based list decoding
A transform that enables generator-matrix-based Reed-Solomon (RS) coded data to be recovered under interpolation-based list decoding is presented. The transform matrix needs to be computed only once and the transformation of an element from the output list to the desired RS coded data block incurs k field multiplications, given a code of dimension k. Index Terms Galois Field Fourier Transform, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2012
ISSN: 1071-5797
DOI: 10.1016/j.ffa.2011.07.007